翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Mark Wegman : ウィキペディア英語版
Mark N. Wegman
Mark N. Wegman is an American computer scientist known for his contributions to algorithms and compiler optimization. Wegman received his B.A. from New York University and his Ph.D. from the University of California, Berkeley. He joined IBM Research in 1975, where he currently serves as head of Computer Science. He is a member of the IBM Academy of Technology and a fellow of the Association for Computing Machinery (1996)〔http://fellows.acm.org/fellow_citation.cfm?id=3183738&srt=alpha&alpha=W〕 and the Institute of Electrical and Electronics Engineers. He became an IBM Fellow in 2007. He was elected to the National Academy of Engineering in 2010.〔http://www8.nationalacademies.org/onpinews/newsitem.aspx?RecordID=02172010〕
Wegman is best known for being one of the inventors of the Static single assignment form, which is used in the analysis portion of most if not all modern optimizing compilers. This work was recognized by SIGPLAN in 2006 with its Programming Languages Achievement Award. He has also made contributions to algorithms and information theory including universal hashing and the LZMW data compression algorithm.
==References==


抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Mark N. Wegman」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.